Information Feedback in Iterative Combinatorial Auctions
نویسندگان
چکیده
Auctions have been getting increasing attention in computer science and economics, as they provide an efficient solution to resource allocation problems with self-interested agents. E-Commerce and finance have emerged as some of their largest application fields. The need for new auction mechanisms that allow complex bids such as bundle or multi-attribute bids has been raised in many situations. Beyond strategic problems, the design of these advanced auction formats exhibits hard computational problems. Pricing is one of the major challenges in designing iterative combinatorial auctions. The presence of bundle bids implies the existence of cases with no linear prices that support competitive equilibrium. This paper introduces a framework of pricing concepts and discusses recent implementations.
منابع مشابه
Effect of Information Feedback on Bidder Behavior in Continuous Combinatorial Auctions
Combinatorial auctions – in which bidders can bid on combinations of goods – can increase the economic efficiency of a trade when goods have complementarities. Recent theoretical developments have lessened the computational complexity of these auctions, but the issue of cognitive complexity remains an unexplored barrier for the online marketplace. This study uses a data-driven approach to explo...
متن کاملImpact of Information Feedback in Continuous Combinatorial Auctions:
Advancements in information technology offer opportunities for designing and deploying innovative market mechanisms that can improve the allocation and procurement processes of businesses. For example, combinatorial auctions – in which bidders can bid on combinations of goods – have been shown to increase the economic efficiency of a trade when goods have complementarities. However, the lack of...
متن کاملToward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
M auctions involve selling several distinct items simultaneously, where bidders can bid on the whole or any part of the lot. Such auctions are referred to as combinatorial auctions. Examples of such auctions include truck delivery routes, industrial procurement, and FCC spectrum. Determining winners in such auctions is an NP-hard problem, and significant research is being conducted in this area...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملEfficient Iterative Combinatorial Auctions
This survey considers the following setting. A seller wants to sell a set of indivisible goods. A set of buyers are interested in buying the goods. Buyers have private values for bundles of goods they are interested in buying. The seller’s objective is to allocate the goods to the buyers efficiently (maximizing the total utility of buyers). Since the values of buyers are private information, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005